Bounded partial-order reduction
نویسندگان
چکیده
منابع مشابه
Bounded Partial-Order Reduction Proof Companion Source Material
Definition 1.6. Preemption-bound persistent sets. A set T ⊆ T of transitions enabled in a state s = final(S) is preemption-bound persistent in s iff for all nonempty sequences α of transitions from s in AG(Pb,c) such that ∀i ∈ dom(α), αi 6∈ T and for all t ∈ T , 1. Pb(S.t) ≤ Pb(S.α1) 2. if Pb(S.t) < Pb(S.α1), then t↔ last(α) and t↔ next(final(S.α), last(α).tid) 3. if Pb(S.t) = Pb(S.α1), then ex...
متن کاملPartial-Order Reduction for Context-Bounded State Exploration
Iterative context-bounding is a technique for performing prioritized search of the state-space of multithreaded programs. A context switch occurs in a concurrent execution when a thread temporarily stops and a different thread resumes. Iterative context-bounding gives priority to executions with fewer context switches during state-space search, exploring for a given context-bound c only those e...
متن کاملCombining Partial Order Reduction with Bounded Model Checking
Model checking is an efficient technique for verifying properties on reactive systems. Partial-order reduction (POR) and symbolic model checking are two common approaches to deal with the state space explosion problem in model checking. Traditionally, symbolic model checking uses BDDs which can suffer from space blowup. More recently bounded model checking (BMC) using SAT-based procedures has b...
متن کاملStatic Partial Order Reduction
1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible execution orders. An impor t an t observ...
متن کاملCartesian Partial-Order Reduction
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semantics that reduces the amount of nondeterminism in concurrent programs by delaying unnecessary context switches. Using this semantics, we construct a novel dynamic partial-order reduction algorithm. The cartesian semant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2544173.2509556